FloodTrail: an efficient file search technique in unstructured peer-to-peer systems
نویسندگان
چکیده
Searching efficiency is a decisive factor concerning scalability in large-scale peer-to-peer (P2P) file sharing systems. While flooding is the most commonly used and user-performance oriented method to broadcast query across an unstructured P2P network, it generates a large number of redundant messages. Our study shows that more than 70% of messages are redundant using flooding in a moderately connected network, which imposes an increasingly excessive burden on the underlying infrastructure, hindering the growth and scalability of P2P systems. To reduce the use of flooding as well as its associated overhead, we utilize the access trail left by a standard flooding, which is a collection of P2P links used by non-redundant messages. Thus the multiple queries following the flooding can be broadcasted along the trail to achieve two goals: (1) The ability of flooding to achieve short response time is maintained; (2) the cost of a broadcast is minimized. Though the trail can be partially damaged in an ad hoc system with constant peer arrivals and departures, we used repeated trail refreshings and additional trail links to make a trail consistently available for query broadcast. We call this trail-based technique FloodTrail. We evaluated the performance of FloodTrail for P2P systems for Web
منابع مشابه
Random Walk Spread and Search in Unstructured P2P
Unstructured Peer-to-Peer applications are very popular on the Internet. An efficient technique for improving performance of search method of these systems is to replicate file location information in P2P. In this paper we present random walk spread mechanism, and random walk spread and search method. Simulation results show that it achieves high success rates at low cost.
متن کاملPopularity-Based Replication Strategy in Unstructured P2P File Sharing Systems
Peer-to-Peer (P2P) networks have shown to be an efficient and successful mechanism for file sharing over the internet. The unstructured P2P systems usually use a blind search method to find the requested data object. Observations have shown that a few of peers share most of data. In order to increase the success rate of blind search and data availability and load balancing, replication techniqu...
متن کاملA Novel Search Technique in Peer-to-Peer Networks
Sufficient uptime is the main concern in a distributed system where there is no centralized organization and control. Therefore searching in P2P file sharing systems is still a big problem due to the high churn rate of nodes. To find a particular piece of data within the network P2P systems explicitly or implicitly provide a lookup mechanism, which largely depends on the availability of nodes. ...
متن کاملSelective Flooding Based on Relevant Nearest-Neighbor using Query Feedback and Similarity across Unstructured Peer-to-Peer Networks
Problem statement: Efficient searching is a fundamental problem for unstructured peer to peer networks. Flooding requires a lot of resources in the network and thus will increase the search cost. Searching approach that utilizes minimum network resources is required to produce efficient searching in the robust and dynamic peer-to-peer network. Approach: This study addressed the need for efficie...
متن کاملLightFlood: an Efficient Flooding Scheme for File Search in Unstructured Peer-to-Peer Systems
“Flooding” is a fundamental operation in unstructured Peer-to-Peer (P2P) file sharing systems, such as Gnutella. Although it is effective in content search, flooding is very inefficient because it results in a great amount of redundant messages. Our study shows that more than 70% of the generated messages are redundant for a flooding with a TTL of 7 in a moderately connected network. Existing e...
متن کامل